Ghost Map: Proving Software Correctness using Games

نویسندگان

  • Ronald Watro
  • Kerry Moffitt
  • Talib Hussain
  • Daniel Wyschogrod
  • John Ostwald
  • Clint Bowers
  • Eric Church
  • Joshua Guttman
  • Qinsi Wang
چکیده

A large amount of intellectual effort is expended every day in the play of on-line games. It would be extremely valuable if one could create a system to harness this intellectual effort for practical purposes. In this paper, we discuss a new crowd-sourced, on-line game, called Ghost Map that presents players with arcade-style puzzles to solve. The puzzles in Ghost Map are generated from a formal analysis of the correctness of a software program. In our approach, a puzzle is generated for each potential flaw in the software and the crowd can produce a formal proof of the software’s correctness by solving all the corresponding puzzles. Creating a crowdsourced game entails many challenges, and we introduce some of the lessons we learned in designing and deploying our game, with an emphasis on the challenges in producing real-time client gameplay that interacts with a server-based verification engine. Finally, we discuss our planned next steps, including extending Ghost Map’s ability to handle more complex software and improving the game mechanics to enable players to bring additional skills and intuitions to bear on those more complex problems. Keywords-games; static analyses; formal verification; crowd souring; games; model checking.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

"A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs

123 " A la Burstall " intermittent assertions induction principles for proving inevitability properties of programs Cousot, P. and R. Cousot, " A la Burstall " intermittent assertions induction principles for proving inevitability properties of programs, Theoretical Computer Science 120 (1993) 123-15.5. We formalize Burstall's (1974) intermittent assertions method (initially conceived for provi...

متن کامل

Tackling Real-Life Relaxed Concurrency with FSL++

We extend fenced separation logic (FSL), a program logic for reasoning about C11 relaxed access and memory fences. Our extensions to FSL allow us to handle concurrent algorithms appearing in practice. New features added to FSL allow for reasoning about concurrent nonatomic reads, atomic updates, ownership transfer via release sequences, and ghost state. As a demonstration of power of the extend...

متن کامل

Automatic Verification for Fine-grained Concurrency

Recent program logics based on separation logic emphasise a modular approach to proving functional correctness for fine-grained concurrent programs. However, these logics have no automation support. In this paper, we present Caper, a prototype tool for automated reasoning in such a logic. Caper is based on symbolic execution, integrating reasoning about interference on shared data and about gho...

متن کامل

Proving Noninterference and Functional Correctness Using Traces

The trace method of software specification is extended to provide a natural semantics for a procedural programming language. This extension provides a method for proving program correctness that permits a direct proof of program Noninterference without having to produce an intermediate finite state machine and unwinding conditions. This approach provides a uniform framework for reasoning about ...

متن کامل

Modular Design and Verification of Logical Knowledge Bases

In this paper we describe a framework for the design of modular knowledge based systems which is motivated by work in algebraic specification and software engineering. The main characteristic of the framework is that verification work can be done in a local setting. We present two concrete module concepts within this framework, and give formal semantics and correctness notions for them. Finally...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014